%0 Conference Proceedings
%4 sid.inpe.br/sibgrapi/2013/07.13.04.02
%2 sid.inpe.br/sibgrapi/2013/07.13.04.02.13
%@doi 10.1109/SIBGRAPI.2013.44
%T Single-Seek Data Layout for Walkthrough Applications
%D 2013
%A Jiang, Shan,
%A Sajadi, Behzad,
%A Gopi, M.,
%@affiliation University of California, Irvine
%@affiliation University of California, Irvine
%@affiliation University of California, Irvine
%E Boyer, Kim,
%E Hirata, Nina,
%E Nedel, Luciana,
%E Silva, Claudio,
%B Conference on Graphics, Patterns and Images, 26 (SIBGRAPI)
%C Arequipa, Peru
%8 5-8 Aug. 2013
%I IEEE Computer Society
%J Los Alamitos
%S Proceedings
%K Out-Of-Core algorithms, Data Layouts.
%X With increasing speed of graphics rendering, the bottleneck in walkthrough applications has shifted to data transfer from secondary storage device to main memory. While techniques designed to reduce the data transfer volume and amortize the transfer cost are well-studied, the disk seek time, which is one of the most important components of the total rendering cost is not reduced explicitly. In this work, we propose an orthogonal approach to address the disk seek time bottleneck, namely single-seek data layouts. This is a solution in one end of the spectrum of solutions that guarantee an upper bound on the number of disk seeks. Using this approach, we can reduce the number of disk seeks required to load the data for any viewpoint in the scene to no more than one. We achieve this single seek layout using data redundancy. We provide a theoretical proof on the upper-bound of this redundancy factor, and analyze its trade-off with the rendering performance through an implementation that uses this data layout for walkthrough applications of datasets with hundreds of millions of triangles.
%@language en
%3 singleseek.pdf